Let $A = \{x_1, x_2, \dots, x_7\}$ and $B = \{y_1, y_2, y_3\}$ be two sets containing seven and three distinct elements respectively. The total number of onto functions $f : A \to B$ such that there exist exactly three elements $x$ in $A$ with $f(x) = y_2$ is equal to:

  • A
    $14 \times {}^7C_3$
  • B
    $16 \times {}^7C_3$
  • C
    $14 \times {}^7C_2$
  • D
    $12 \times {}^7C_2$

Explore More

Similar Questions

In each of the following cases,state whether the function is one-one,onto or bijective. Justify your answer. $f : R \rightarrow R$ defined by $f(x) = 1 + x^2$.

Consider the function $f(x) = x^3 - 8x^2 + 20x - 13$. The function $f: R \rightarrow R$ is:

If $R$ denotes the set of all real numbers,then the function $f: R \rightarrow R$ defined by $f(x)=|x|$ is

If $f: S \rightarrow R$ where $S$ is the set of all non-singular matrices of order $2$ over $R$ and $f\left(\begin{bmatrix} a & b \\ c & d \end{bmatrix}\right) = ad - bc$, then:

If $f : R \rightarrow R$ is defined as $f(x) = x - [x] + 3$,$\forall x \in R$,then $f$ is

Vedclass Products

For Students

Vedclass Test Series

Mock tests in real JEE/NEET style with performance analysis. 5-day free trial.

Start Free Trial
For Teachers

Exam Paper Generator

Generate Set A/B/C/D exam papers from 7.5L+ questions in 2 minutes. 3 chapters free.

Try Free
For Institutes

Online Exam Module

Live online exams with unlimited students, 360° analytics & white-label branding.

See Demo